Enumeration of spanning trees of middle graphs
نویسندگان
چکیده
منابع مشابه
Enumeration of spanning trees of certain graphs
In this note we give an algorithm which enables us to encode and enumerate all the spanning trees of a multipartite graph (see below). This algorithm may turn out to be useful for the enumeration of spanning trees satisfying certain conditions. The number of spanning trees of a given graph Γ without loops and without multiple edges will be denoted by_i(T). We shall consider the graphs Γ = T(G; ...
متن کاملEnumeration of Spanning Trees of Graphs
In this paper, we define and study polynomials that enumerate spanning trees according to degrees of all vertices. These polynomials have a certain reciprocity. A formula that reduces the polynomials for multipartite graphs to the polynomials for component graphs is also found. There is a generalization of Prüfer’s coding that corresponds to the latter formula. All results are extended to the c...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملLocal Convergence of Graphs and Enumeration of Spanning Trees
A spanning tree in a connected graph G is a subgraph that contains every vertex of G and is itself a tree. Clearly, if G is a tree then it has only one spanning tree. Every connected graph contains at least one spanning tree: iteratively remove an edge from any cycle that is present until the graph contains no cycles. Counting spanning trees is a very natural problem. Following Lyons [5] we wil...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2017
ISSN: 0096-3003
DOI: 10.1016/j.amc.2017.02.040